The Number of Descendants in Simply Generated Random Trees
نویسنده
چکیده
The aim of this note is to generalize some recent results for binary trees by Panholzer and Prodinger [15] to a larger class of rooted trees. The number of descendants of a node j is the number of nodes in the subtree rooted at j, and the number of ascendants is the number of nodes between j and the root. Recently, Panholzer and Prodinger [15] studied the behavior of these parameters in binary trees during various traversal algorithms. The case of binary search trees was treated by Mart́ınez, Panholzer and Prodinger [14]. In this paper we will study the number of descendants in simply generated trees (defined below). The number of ascendants is already treated in [1] and [10]. Let us start with a description of the traversal algorithms we will investigate. In the binary case there are basically three traversal algorithms. All of them are recursive algorithms treating the left subtree before the right subtree. They differ with respect to the visit of the root: first (preorder), middle (inorder), and last (postorder). We will study the number of descendants in simply generated trees during preorder and postorder traversal. Since the outdegree of any node in a simply generated tree need not be equal to zero or two, inorder traversal cannot be well defined for that class of trees. Let us recall the definition of simply generated trees. Let A be a class of plane rooted trees and define for T ∈ A the size |T | by the number of nodes of T . Furthermore there is assigned a weight ω(T ) to each T ∈ A. Let an denote the quantity an = ∑
منابع مشابه
Descendants in Increasing Trees
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellings of the nodes by distinct integers of the set {1, . . . , n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular interest: recurs...
متن کاملLimit Laws for Local Counters in Random Binary Search Tree
Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for rn-dependent random variables . Examples include : the number of leaves (La ), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left de...
متن کاملIsolating a Leaf in Rooted Trees via Random Cuttings
We consider a recursive procedure for destroying rooted trees and isolating a leaf by removing a random edge and keeping the subtree, which does not contain the original root. For two tree families, the simply generated tree families and increasing tree families, we study here the number of random cuts that are necessary to isolate a leaf. We can show limiting distribution results of this param...
متن کاملOn the number of transversals in random trees
We study transversals in random trees with n vertices asymptotically as n tends to infinity. Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of the vertex set of a tree is a transversal for the class of simply generated trees and for Pólya trees. The last parameter was already studied by ...
متن کاملAnalysis of three graph parameters for random trees
We consider three basic graph parameters, the node-independence number, the path node-covering number, and the size of the kernel, and study their distributional behaviour for an important class of random tree models, namely the class of simply generated trees, which contains, e.g., binary trees, rooted labelled trees and planted plane trees, as special instances. We can show for simply generat...
متن کامل